Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions
نویسندگان
چکیده
منابع مشابه
SERIE B INFORMATIK Voronoi Diagrams of Lines in Space Under Polyhedral Convex Distance Functions
The combinatorial complexity of the Voronoi diagram of n lines in three dimensions under a convex distance function induced by a polytope with a constant number of edges is shown to be O n n log n where is a slowly growing inverse of the Ackermann function There are arrangements of n lines where this complexity can be as large as n n Work by Paul Chew and Klara Kedem has been supported by AFOSR...
متن کاملStraight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions
We consider the question under which circumstances the straight skeleton and the Voronoi diagram of a given input shape coincide. More precisely, we investigate convex distance functions that stem from centrally symmetric convex polyhedra as unit balls and derive sufficient and necessary conditions for input shapes in order to obtain identical straight skeletons and Voronoi diagrams with respec...
متن کاملMost Likely Voronoi Diagrams in Higher Dimensions
The Most Likely Voronoi Diagram is a generalization of the well known Voronoi Diagrams to a stochastic setting, where a stochastic point is a point associated with a given probability of existence, and the cell for such a point is the set of points which would classify the given point as its most likely nearest neighbor. We investigate the complexity of this subdivision of space in d dimensions...
متن کاملTwo-Site Voronoi Diagrams under Geometric Distance Functions
We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, and analyze the structure and complexity of the nearestand furthest-neighbor Voronoi diagrams of a point set with respect to these distance functions.
متن کاملKinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions
Let P be a set of n points and Q a convex k-gon in R2. We analyze in detail the topological (or discrete) changes in the structure of the Voronoi diagram and the Delaunay triangulation of P, under the convex distance function defined by Q, as the points of P move along prespecified continuous trajectories. Assuming that each point of P moves along an algebraic trajectory of bounded degree, we e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1998
ISSN: 0179-5376
DOI: 10.1007/pl00009366